13 research outputs found
The number of abundant elements in union-closed families without small sets
We let be a finite family of sets closed under taking unions
and , and call an element abundant if it
belongs to more than half of the sets of . In this notation, the
classical Frankl's conjecture (1979) asserts that has an abundant
element. As possible strengthenings, Poonen (1992) conjectured that if
has precisely one abundant element, then this element belongs to
each set of , and Cui and Hu (2019) investigated whether
has at least abundant elements if a smallest set of
is of size at least . Cui and Hu conjectured that this holds
for and asked whether this also holds for the cases and where is the size of the largest set of .
We show that has at least abundant elements if , and that has at least abundant elements if , and we construct a union-closed family with precisely abundant
elements for every and satisfying and
(and for and ). We also note that always has at
least abundant elements. On the other hand, we
construct a union-closed family with precisely two abundant elements for every
and satisfying . Lastly, we show that Cui
and Hu's conjecture for stands between Frankl's conjecture and Poonen's
conjecture
Graphs and subgraphs with bounded degree
"The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These problems are NP-complete and NP-hard, respectively. While some necessary and sufficient conditions are known, to date, no practical characterization of hamiltonian graphs has been found. There are several ways to generalize the notion of a hamiltonian cycle. In this thesis we make original contributions in two of them, namely k-walks and r-trestles." --Abstract.Doctor of Philosoph
FO model checking of interval graphs
We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that FO model checking and successor-invariant FO model checking can be solved in time O(n log n) for n-vertex interval graphs with representations containing only intervals with lengths from a prescribed finite set. We complement this result by showing that the same is not true if the lengths are restricted to any set that is dense in an open subset, e.g. in the set (1, 1 + ε)
On 2-walks in chordal planar graphs
A 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said to be chordal if each cycle different from a 3-cycle has a chord. We prove that every chordal planar graph G with toughness t (G) > frac(3, 4) has a 2-walk. © 2008 Elsevier B.V. All rights reserved
Trestles in the squares of graphs
We show that the square of every connected S(K_{1,4})-free graph satisfying a matching condition has a 2-connected spanning subgraph of maximum degree at most 3. Furthermore, we characterise trees whose square has a 2-connected spanning subgraph of maximum degree at most k. This generalises the results on S(K_{1,3})-free graphs of Henry and Vogler (1985) and Harary and Schwenk (1971), respectively
Divisibility conditions in almost Moore digraphs with selfrepeats
Moore digraph is a digraph with maximum out-degree d, diameter k and order Md, k = 1 + d + ... + dk. Moore digraphs exist only in trivial cases if d = 1 (i.e., directed cycle Ck) or k = 1 (i.e., complete symmetric digraph). Almost Moore digraphs are digraphs of order one less than Moore bound. We shall present new properties of almost Moore digraphs with selfrepeats from which we prove nonexistence of almost Moore digraphs for some k and d. © 2006 Elsevier B.V. All rights reserved.C
Toughness threshold for the existence of 2-walks in K4-minor free graphs
We show that every K4-minor free graph with toughness greater than 4/7 has a 2-walk, i.e., a closed walk visiting each vertex at most twice. We also give an example of a 4/7-tough K4-minor free graph with no 2-walk. 1 Introduction An active area of graph theory is the study of Hamilton cycles [8, 9], in par-ticular, the study of conditions based on different connectivity parameters that guarantees the existence of a Hamilton cycle in a graph. One of themost famous conjectures in this area is Chv'atal's conjecture. Its original version asserts that every 2-tough graph G is hamiltonian. Let us recallthat a graph G is hamiltonian if it contains a cycle passing through all itsvertices, and G is ff-tough if the number o / (A) of components of G \ A is atmost max{1, |A|/ff} for every non-empty set A of the vertices. The originalconjecture has been disproved by Bauer et al. [1] who constructed (
Stability of hereditary graph classes under closure operations
If C is a subclass of the class of claw-free graphs, then C is said to be stable if, for any GaC, the local completion of G at any vertex is also in C. If cl is a closure operation that turns a claw-free graph into a line graph by a series of local completions and C is stable, then cl(G)aC for any GaC. In this article, we study stability of hereditary classes of claw-free graphs defined in terms of a family of connected closed forbidden subgraphs. We characterize line graph preimages of graphs in families that yield stable classes, we identify minimal families that yield stable classes in the finite case, and we also give a general background for techniques for handling unstable classes by proving that their closure may be included into another (possibly stable) class
Bounding the distance among longest paths in a connected graph
It is easy to see that in a connected graph any 2 longest paths have a vertex in common. For k >= 7, Skupień in 1966 obtained a connected graph in which some longest paths have no common vertex, but every k - 1 longest paths have a common vertex. It is not known whether every 3 longest paths in a connected graph have a common vertex and similarly for 4, 5, and 6 longest path. Fujita et al. in 2015 give an upper bound on distance among 3 longest paths in a connected graph. In this paper we give a similar upper bound on distance between 4 longest paths and also for k longest paths, in general